Enhancing Channel Coding using AES Block Cipher
نویسندگان
چکیده
منابع مشابه
Enhancing Channel Coding using AES Block Cipher
A key benefit of channel coding is the ability to protect data against channel impairments. Essentially, the channel coder adds redundancy bits that provide a way to correct corrupted data. Encryption is another way of protecting data against channel impairments and unintended interception or forging. This paper introduces an efficient approach of increasing coding gain at the receiver end. The...
متن کاملAuthors : The Rijndael Block Cipher AES Proposal
After the selection of Rijndael as the AES, it was decided to change the names of some of its component functions in order to improve the readability of the standard. However, we see that many recent publications on Rijndael and the AES still use the old names, mainly because the original submission documents using the old names, are still available on the Internet. In this note we repeat quick...
متن کاملAES CCMP Algorithm with N-Way Interleaved Cipher Block Chaining
Nowadays, the increased use of battery-powered mobile appliances and the urge to access time-sensitive data anytime anywhere has fuelled a high demand for wireless networks. However, wireless networks are susceptible to intrusion and security problems. There is an inherent need to secure the wireless data communication to ensure the confidentiality, authenticity, integrity and non repudiation o...
متن کاملKey-Dependent S-Box Generation in AES Block Cipher System
Advanced Encryption Standard (AES) block cipher system is widely used in cryptographic applications. A nonlinear substitution operation is the main factor of the AES cipher system strength. The purpose of the proposed approach is to generate the random S-boxes changing for every change of the secret key. The fact that the S-boxes are randomly key-dependent and unknown is the main strength of th...
متن کاملAES Cipher Keys Suitable for Efficient Side-Channel Vulnerability Evaluation
This paper investigates pairs of AES-128 cipher keys and plaintexts which result in being “quiet” in the final round, i.e., whose 128-bit State holds the same bit pattern before and after Round 10. We show that the number of such quiet plaintexts (resulting in Hamming distance 0) for any cipher key is at most 5,914,624, and that there exist exactly 729 cipher keys having such a maximum number. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/9933-4568